Two Simple Characterizations of Well-Founded Semantics

نویسنده

  • Teodor C. Przymusinski
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Level mapping characterizations for quantitative and disjunctive logic programs

Several different approaches of logic programming semantics have been proposed during the last two decades. These semantics varied in many aspects and it was difficult to find the exact relationships between them. Hitzler and Wendt proposed a new method, based on level mappings, which allows to provide uniform characterizations of different semantics for logic programs. They gave new characteri...

متن کامل

Characterizations and Implementation of Static Semantics of Disjunctive Programs

In recent years, much work was devoted to the study of theoretical foundations of Disjunctive Logic Programs and Disjunctive Deductive Databases. While the semantics of non-disjunctive programs is fairly well understood and there exist several implementations of the best known semantics (well-founded semantics and stable semantics), the declarative and computational foundations of disjunctive p...

متن کامل

Epistemic Foundation of the Well-Founded Semantics over Bilattices

We define new, both model-theoretical and fixpoint-based, characterizations of the well-founded semantics for logic programs in the general setting of bilattices. This work lights the role of the CWA, used in the well-founded semantics as a carrier of falsehood, and shows that the definition of that semantics does not require any separation of positive and negative information nor any program t...

متن کامل

A Comparative Study of Disjunctive Well-Founded Semantics

A lot of different proposals were made claiming to extend the wellfounded semantics to logic programs with disjunction. None of these however has been established as ’the’ disjunctive well-founded semantics which is mainly caused by the different intuitive ideas on which these semantics are based. In fact, some of them are even incomparable with respect to their derivable knowledge, and systema...

متن کامل

A uniform approach to logic programming semantics

Part of the theory of logic programming and nonmonotonic reasoning concerns the study of fixed-point semantics for these paradigms. Several different semantics have been proposed during the last two decades, and some have been more successful and acknowledged than others. The rationales behind those various semantics have been manifold, depending on one’s point of view, which may be that of a p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992